On Refinement of Generic State-Based Software Components

This paper characterizes refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs. On Refinement of Generic State-based Software Components Sun Meng1 and Lúıs S. Barbosa2 1 LMAM, School of Mathematical Science Peking University, China [email protected]@water.pku.edu.cn 2 Department of Informatics Minho University, Portugal [email protected]@di.uminho.pt Abstract. This paper characterizes refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs. This paper characterizes refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs.